Design of an Input-queued ATM Switch supporting multicast and Research on its Scheduling Policy
نویسندگان
چکیده
This work is supported by Chinese NSF (item number: 98046) and “973” project (item number: G1998030405). Zhai Mingyu, Ph.D candidate, department of computer science and engineering, Southeast Univ. His research interest includes high-speed network, and network security.Email: [email protected]. Zhao Qi, research assistant, department of computer science and engineering, Southeast Univ. His research interest includes high-speed network, and wireless network.Luo Junzhou, professor. department of computer science and engineering, Southeast Univ. His research interest includes computer network, and Petri Net.Gu Guanqun, professor, Academician of Chinese Engineering Academy , department of computer science and engineering, Southeast Univ. His research interest includes computer network, and distributed computing. Abstract Currently the research on input-queued ATM switches is one of the most active research fields. Many achievements have been made in the research on scheduling algorithms for unicast input-queued ATM switches and also applied in commerce. But the goal of the research on scheduling algorithms for multicast input-queued ATM switches only focuses on providing high throughput and inadvertently ignoring its undesired effects on QoS of the multicast traffic. In this paper we present a design scheme of input-queued ATM switches supporting multicast and corresponding scheduling algorithm, referred to as multicast longest normalized queue first (MLNQF). The algorithm MLNQF has the characteristics of improving throughput, satisfying QoS requirements and providing service fairly.
منابع مشابه
Tetris Models for Multicast Switches
This paper presents a uni ed approach to the analysis of schedulers for input-queued multicast ATM switches. It is shown that the general multicast scheduling problem can be mapped onto a variation of the popular blockpacking game Tetris. Within this common framework, one is able to describe and analyze any multicast scheduling policy in an intuitive and geometric fashion. One such policy TATRA...
متن کاملIntegration of unicast and multicast scheduling in input-queued packet switches
Packet queuing and scheduling, two of the critical components in an input-queued packet switch, have been extensively studied in the context of either pure unicast traffic or pure multicast traffic. Unfortunately, the results from a study in one context are not applicable to the other context. The design of integrated scheduling for both types of traffic remains an open issue. This paper deals ...
متن کاملMulticast Scheduling for Input-Queued Switches
The demand for network bandwidth is growing much faster than the increase in commercially available memory bandwidth, causing a growing interest in input-queued switches. Furthermore, an increase in the proportion of multicast traffic in today's networks makes it important that they support such traffic efficiently. This paper presents the design of the scheduler for an MxN input-queued multica...
متن کاملSCHEDULING MULTICAST CELLS IN AN INPUT-QUEUED SWITCH - INFOCOM '96. Fifteenth Annual Joint Conference of the IEEE Computer Societies. 'Networking the Nex
In this paper we consider policies for scheduling cells in an input-queued multicast switch. It is assumed that each input maintains a single queue for arriving multicast cells and that only the cell at the head of line (HOL) can be observed and scheduled at one time. The policies are assumed to be work-conserving, which means that cells may be copied to the outputs that they request over sever...
متن کاملScheduling Multicast Cells in an Input-Queued Switch
In this paper we consider policies for scheduling cells in an input-queued multicast switch. It is assumed that each input maintains a single queue for arriving multicast cells and that only the cell at the head of line (HOL) can be observed and scheduled at one time. The policies are assumed to be work-conserving,which means that cells may be copied to the outputs that they request over severa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001